/**
 * Created by IntelliJ IDEA.
 * User: zm
 * Date: 2023/4/1
 */
public class Demo9 {
    public static int longestCommonSubsequence(String text1, String text2) {
        int n = text1.length();int m = text2.length();
        int[][] dp = new int[n + 1][m + 1];
        for(int i = 1; i <= n; i++){
            char ch1 = text1.charAt(i - 1);
            for(int j = 1; j <= m; j++){
                char ch2 = text2.charAt(j - 1);
                if(ch1 == ch2){
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }else{
                    dp[i][j] = Math.max(dp[i - 1][j],dp[i][j - 1]);
                }
            }
        }

        return dp[n][m];
    }

    public static void main(String[] args) {
        int a = 32;
        System.out.println(a = a  + 4 * 6);
        String text1 = "abcde";
        String text2 = "ace";
        longestCommonSubsequence(text1,text2);
    }
}
